Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single substring more than once.
Return the minimum number of substrings in such a partition.
Note that each character should belong to exactly one substring in a partition.
Input: s = "abacaba" Output: 4 Explanation: Two possible partitions are ("a","ba","cab","a") and ("ab","a","ca","ba"). It can be shown that 4 is the minimum number of substrings needed. Input: s = "ssssss" Output: 6 Explanation: The only valid partition is ("s","s","s","s","s","s"). 1 <= s.length <= 105sconsists of only English lowercase letters.
implSolution{pubfnpartition_string(s:String) -> i32{letmut mask = 0;letmut ret = 1;for c in s.bytes(){if(1 << (c - b'a'))& mask != 0{ mask = 0; ret += 1;} mask |= 1 << (c - b'a');} ret }}